// T1
// O(n) 100pts

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5+5;
int r[N];
int n;

int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);

    scanf("%d", &n);
    for (int i=0; i<n; i++)
        scanf("%d", &r[i]);

    sort(r, r+n);

    queue<int> q;
    int cnt = 0;
    for (int i=0; i<n; i++)
    {
        if (!q.empty() && q.front()<r[i])
        {
            q.pop();
            cnt++;
        }
        q.push(r[i]);
    }

    printf("%d\n", n-cnt);
    return 0;
}